Interactive beliefs, epistemic independence and strong rationalizability†
نویسندگان
چکیده
We use a universal, extensive form interactive beliefs system to provide an epistemic characterization of a weak and a strong notion of rationalizability with independent beliefs. The weak solution concept is equivalent to backward induction in generic perfect information games where no player moves more than once in any play. The strong solution concept is related to explicability (Reny, 1992) and is outcome equivalent to backward induction in generic games of perfect information.
منابع مشابه
Rationalizability and Epistemic Priority Orderings
At the beginning of a dynamic game, players may have exogenous theories about how the opponents are going to play. Suppose that these theories are commonly known. Then, players will refine their first-order beliefs, and challenge their own theories, through strategic reasoning. I develop and characterize epistemically a new solution concept, Selective Rationalizability, which accomplishes this ...
متن کاملAlgorithmic Characterization of Rationalizability in Extensive Form Games∗
We construct a dynamic epistemic model for extensive form games, which generates a hierarchy of beliefs for each player over her opponents’ strategies and beliefs, and tells us how those beliefs will be revised as the game proceeds. We use the model to analyze the implications of the assumption that the players possess common (true) belief in rationality, thus extending the concept of rationali...
متن کاملSequential and quasi-perfect rationalizability in extensive games
Within an epistemic model for two-player extensive games, we formalize the event that each player believes that his opponent chooses rationally at all information sets. Letting this event be common certain belief yields the concept of sequential rationalizability. Adding preference for cautious behavior to this event likewise yields the concept of quasi-perfect rationalizability. These concepts...
متن کاملInteractive Epistemology and Solution Concepts for Games with Asymmetric Information
We use an interactive epistemology framework to provide a systematic analysis of some solution concepts for games with asymmetric information. We characterize solution concepts using expressible epistemic assumptions, represented as events in the canonical space generated by primitive uncertainty about the payoff relevant state, payoff irrelevant information, and actions. In most of the paper, ...
متن کاملOrder independence and rationalizability
Two natural strategy elimination procedures have been studied for strategic games. The first one involves the notion of (strict, weak, etc) dominance and the second the notion of rationalizability. In the case of dominance the criterion of order independence allowed us to clarify which notions and under what circumstances are robust. In the case of rationalizability this criterion has not been ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999